IJCAI 2015 - The Worst Best Ever
نویسنده
چکیده
منابع مشابه
Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees
Algorithm configuration methods have achieved much practical success, but to date have not been backed by meaningful performance guarantees. We address this gap with a new algorithm configuration framework, Structured Procrastination. With high probability and nearly as quickly as possible in the worst case, our framework finds an algorithm configuration that provably achieves near optimal perf...
متن کاملGrid-based SensorDCSP
We introduce Grid-based SensorDCSP, a geometrically structured benchmark problem for the study of distributed CSP algorithms. This domain provides realistic structure of the communication and tracking constraints. We formally define this problem, and perform its worst-case complexity analysis. Likewise, we provide an average case empirical analysis of the AWC algorithm, studying its behavior on...
متن کاملNew Metrics and Algorithms for Stochastic Goal Recognition Design Problems
Goal Recognition Design (GRD) problems involve identifying the best ways to modify the underlying environment that agents operate in, typically by making a subset of feasible actions infeasible, in such a way that agents are forced to reveal their goals as early as possible. The Stochastic GRD (S-GRD) model is an important extension that introduced stochasticity to the outcome of agent actions....
متن کاملRefining the Basic Constraint Propagation Algorithm
Propagating constraints is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the use of the best algorithms. But the ease of integration is also one of the concerns when implementing an algorithm in a constraint solver. This paper focuses on AC-3, which is the simplest arc consistency algorithm kno...
متن کاملFast Algorithm for Connected Row Convex Constraints
Many interesting tractable problems are identified under the model of Constraint Satisfaction Problems. These problems are usually solved by forcing a certain level of local consistency. In this paper, for the class of connected row convex constraints, we propose a novel algorithm which is based on the ideas of variable elimination and efficient composition of row convex and connected constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Informatica (Slovenia)
دوره 39 شماره
صفحات -
تاریخ انتشار 2015